Storage Allocation for Real-Time, Embedded Systems

نویسندگان

  • Steven M. Donahue
  • Matthew P. Hampton
  • Morgan Deters
  • Jonathan M. Nye
  • Ron Cytron
  • Krishna M. Kavi
چکیده

Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can o er. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and embedded systems. We have implemented these algorithms, and results are presented that validate the predictability and e ciency of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic storage allocation for real - time embedded systems ∗

Dynamic memory allocation DSA algorithms have played in important role in the modern software engineering paradigms and techniques (as object oriented paradigm). Additionally, its utilization allows to increase the flexibility and functionalities of the applications. There exists in the literature a large number of works and references to this particular issue. However, in the real-time communi...

متن کامل

Reducing memory fragmentation in network applications with dynamic memory allocators optimized for performance

The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in heavy reliance on dynamic memory allocation. The most significant problem in dynamic memory allocation is fragmentation, which can cause the system to run out of memory and crash, if it is left unchecked. The available...

متن کامل

Reducing Memory Fragmentation with Performance-Optimized Dynamic Memory Allocators in Network Applications

The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in heavy reliance on dynamic memory allocation. The most significant problem in dynamic memory allocation is fragmentation, which can cause the system to run out of memory and crash, if it is left unchecked. The available...

متن کامل

Task-level Memory Hierarchy Synthesis for Low Power Real-Time Systems

Memory hierarchies (caches) are essential for modern embedded cores to obtain high performance. They also represents a significant portion of the cost, size and power consumption of many embedded systems. This paper describes a task-level memory synthesis algorithm that synthesizes the memory hierarchies for multi-task real-time systems under the constraints of performance, power and cost. Give...

متن کامل

Register Allocation for Embedded Systems

Compilers play an important part in the system performance improvement. A compilation process is to translate source code from a highlevel programming language to a lower level language. For embedded systems, the system resource such as the number of registers, cache size, and memory size are very limited. Therefore, an efficient compilation can particularly have great effect on the system perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001